TSTP Solution File: ITP123^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP123^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:02 EDT 2024
% Result : Theorem 0.22s 0.58s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 31 ( 13 unt; 8 typ; 0 def)
% Number of atoms : 43 ( 6 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 195 ( 17 ~; 11 |; 3 &; 158 @)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 ^ 33 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_49,type,
inf: a > a > a ).
thf(decl_50,type,
less: a > a > $o ).
thf(decl_51,type,
less_eq: a > a > $o ).
thf(decl_52,type,
sup: a > a > a ).
thf(decl_53,type,
x: a ).
thf(decl_54,type,
y: a ).
thf(decl_55,type,
z: a ).
thf(conj_4,conjecture,
less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ),
file('/export/starexec/sandbox/tmp/tmp.wEVOdgIyjT/E---3.1_13196.p',conj_4) ).
thf(fact_96_local_Ole__supE,axiom,
! [X4: a,X3: a,X1: a] :
( ( less_eq @ ( sup @ X4 @ X3 ) @ X1 )
=> ~ ( ( less_eq @ X4 @ X1 )
=> ~ ( less_eq @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wEVOdgIyjT/E---3.1_13196.p',fact_96_local_Ole__supE) ).
thf(fact_50_local_Odual__order_Oorder__iff__strict,axiom,
! [X3: a,X4: a] :
( ( less_eq @ X3 @ X4 )
<=> ( ( less @ X3 @ X4 )
| ( X4 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wEVOdgIyjT/E---3.1_13196.p',fact_50_local_Odual__order_Oorder__iff__strict) ).
thf(fact_39_local_Osup_Ocommute,axiom,
! [X4: a,X3: a] :
( ( sup @ X4 @ X3 )
= ( sup @ X3 @ X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.wEVOdgIyjT/E---3.1_13196.p',fact_39_local_Osup_Ocommute) ).
thf(conj_3,hypothesis,
less @ ( sup @ x @ ( inf @ y @ z ) ) @ ( inf @ y @ ( sup @ x @ z ) ),
file('/export/starexec/sandbox/tmp/tmp.wEVOdgIyjT/E---3.1_13196.p',conj_3) ).
thf(fact_99_local_Ole__supI2,axiom,
! [X1: a,X3: a,X4: a] :
( ( less_eq @ X1 @ X3 )
=> ( less_eq @ X1 @ ( sup @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wEVOdgIyjT/E---3.1_13196.p',fact_99_local_Ole__supI2) ).
thf(c_0_6,negated_conjecture,
~ ( less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_4])]) ).
thf(c_0_7,plain,
! [X4: a,X3: a,X1: a] :
( ( less_eq @ ( sup @ X4 @ X3 ) @ X1 )
=> ~ ( ( less_eq @ X4 @ X1 )
=> ~ ( less_eq @ X3 @ X1 ) ) ),
inference(fof_simplification,[status(thm)],[fact_96_local_Ole__supE]) ).
thf(c_0_8,plain,
! [X735: a,X736: a] :
( ( ~ ( less_eq @ X735 @ X736 )
| ( less @ X735 @ X736 )
| ( X736 = X735 ) )
& ( ~ ( less @ X735 @ X736 )
| ( less_eq @ X735 @ X736 ) )
& ( ( X736 != X735 )
| ( less_eq @ X735 @ X736 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_50_local_Odual__order_Oorder__iff__strict])])])]) ).
thf(c_0_9,negated_conjecture,
~ ( less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X548: a,X549: a] :
( ( sup @ X548 @ X549 )
= ( sup @ X549 @ X548 ) ),
inference(variable_rename,[status(thm)],[fact_39_local_Osup_Ocommute]) ).
thf(c_0_11,plain,
! [X563: a,X564: a,X565: a] :
( ( ( less_eq @ X563 @ X565 )
| ~ ( less_eq @ ( sup @ X563 @ X564 ) @ X565 ) )
& ( ( less_eq @ X564 @ X565 )
| ~ ( less_eq @ ( sup @ X563 @ X564 ) @ X565 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_12,plain,
! [X1: a,X2: a] :
( ( less_eq @ X1 @ X2 )
| ~ ( less @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,hypothesis,
less @ ( sup @ x @ ( inf @ y @ z ) ) @ ( inf @ y @ ( sup @ x @ z ) ),
inference(split_conjunct,[status(thm)],[conj_3]) ).
thf(c_0_14,negated_conjecture,
~ ( less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X2: a,X1: a] :
( ( sup @ X1 @ X2 )
= ( sup @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X572: a,X573: a,X574: a] :
( ~ ( less_eq @ X572 @ X573 )
| ( less_eq @ X572 @ ( sup @ X574 @ X573 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_99_local_Ole__supI2])])]) ).
thf(c_0_17,plain,
! [X1: a,X3: a,X2: a] :
( ( less_eq @ X1 @ X2 )
| ~ ( less_eq @ ( sup @ X1 @ X3 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_18,hypothesis,
less_eq @ ( sup @ x @ ( inf @ y @ z ) ) @ ( inf @ y @ ( sup @ x @ z ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_19,negated_conjecture,
~ ( less_eq @ x @ ( sup @ z @ ( inf @ y @ ( sup @ x @ z ) ) ) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
! [X1: a,X3: a,X2: a] :
( ( less_eq @ X1 @ ( sup @ X3 @ X2 ) )
| ~ ( less_eq @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,hypothesis,
less_eq @ x @ ( inf @ y @ ( sup @ x @ z ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : ITP123^1 : TPTP v8.1.2. Released v7.5.0.
% 0.11/0.16 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 12:46:16 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.22/0.52 Running higher-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.wEVOdgIyjT/E---3.1_13196.p
% 0.22/0.58 # Version: 3.1.0-ho
% 0.22/0.58 # Preprocessing class: HSLSSMSSSSSNHSA.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting full_lambda_9 with 1500s (5) cores
% 0.22/0.58 # Starting new_ho_11 with 300s (1) cores
% 0.22/0.58 # Starting sh2l with 300s (1) cores
% 0.22/0.58 # Starting new_bool_6 with 300s (1) cores
% 0.22/0.58 # full_lambda_9 with pid 13274 completed with status 0
% 0.22/0.58 # Result found by full_lambda_9
% 0.22/0.58 # Preprocessing class: HSLSSMSSSSSNHSA.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting full_lambda_9 with 1500s (5) cores
% 0.22/0.58 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.22/0.58 # Search class: HGHSM-FSLM21-MHSFFSBN
% 0.22/0.58 # partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.22/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.58 # Starting almost_fo_1 with 811s (1) cores
% 0.22/0.58 # Starting full_lambda_9 with 151s (1) cores
% 0.22/0.58 # Starting post_as_ho3 with 136s (1) cores
% 0.22/0.58 # Starting full_lambda_10 with 136s (1) cores
% 0.22/0.58 # Starting full_lambda_5 with 136s (1) cores
% 0.22/0.58 # full_lambda_10 with pid 13283 completed with status 0
% 0.22/0.58 # Result found by full_lambda_10
% 0.22/0.58 # Preprocessing class: HSLSSMSSSSSNHSA.
% 0.22/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.58 # Starting full_lambda_9 with 1500s (5) cores
% 0.22/0.58 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.22/0.58 # Search class: HGHSM-FSLM21-MHSFFSBN
% 0.22/0.58 # partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.22/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.58 # Starting almost_fo_1 with 811s (1) cores
% 0.22/0.58 # Starting full_lambda_9 with 151s (1) cores
% 0.22/0.58 # Starting post_as_ho3 with 136s (1) cores
% 0.22/0.58 # Starting full_lambda_10 with 136s (1) cores
% 0.22/0.58 # Preprocessing time : 0.004 s
% 0.22/0.58 # Presaturation interreduction done
% 0.22/0.58
% 0.22/0.58 # Proof found!
% 0.22/0.58 # SZS status Theorem
% 0.22/0.58 # SZS output start CNFRefutation
% See solution above
% 0.22/0.58 # Parsed axioms : 290
% 0.22/0.58 # Removed by relevancy pruning/SinE : 102
% 0.22/0.58 # Initial clauses : 244
% 0.22/0.58 # Removed in clause preprocessing : 5
% 0.22/0.58 # Initial clauses in saturation : 239
% 0.22/0.58 # Processed clauses : 316
% 0.22/0.58 # ...of these trivial : 13
% 0.22/0.58 # ...subsumed : 115
% 0.22/0.58 # ...remaining for further processing : 188
% 0.22/0.58 # Other redundant clauses eliminated : 21
% 0.22/0.58 # Clauses deleted for lack of memory : 0
% 0.22/0.58 # Backward-subsumed : 0
% 0.22/0.58 # Backward-rewritten : 1
% 0.22/0.58 # Generated clauses : 276
% 0.22/0.58 # ...of the previous two non-redundant : 156
% 0.22/0.58 # ...aggressively subsumed : 0
% 0.22/0.58 # Contextual simplify-reflections : 2
% 0.22/0.58 # Paramodulations : 248
% 0.22/0.58 # Factorizations : 0
% 0.22/0.58 # NegExts : 0
% 0.22/0.58 # Equation resolutions : 21
% 0.22/0.58 # Disequality decompositions : 0
% 0.22/0.58 # Total rewrite steps : 114
% 0.22/0.58 # ...of those cached : 76
% 0.22/0.58 # Propositional unsat checks : 0
% 0.22/0.58 # Propositional check models : 0
% 0.22/0.58 # Propositional check unsatisfiable : 0
% 0.22/0.58 # Propositional clauses : 0
% 0.22/0.58 # Propositional clauses after purity: 0
% 0.22/0.58 # Propositional unsat core size : 0
% 0.22/0.58 # Propositional preprocessing time : 0.000
% 0.22/0.58 # Propositional encoding time : 0.000
% 0.22/0.58 # Propositional solver time : 0.000
% 0.22/0.58 # Success case prop preproc time : 0.000
% 0.22/0.58 # Success case prop encoding time : 0.000
% 0.22/0.58 # Success case prop solver time : 0.000
% 0.22/0.58 # Current number of processed clauses : 60
% 0.22/0.58 # Positive orientable unit clauses : 25
% 0.22/0.58 # Positive unorientable unit clauses: 2
% 0.22/0.58 # Negative unit clauses : 9
% 0.22/0.58 # Non-unit-clauses : 24
% 0.22/0.58 # Current number of unprocessed clauses: 188
% 0.22/0.58 # ...number of literals in the above : 394
% 0.22/0.58 # Current number of archived formulas : 0
% 0.22/0.58 # Current number of archived clauses : 111
% 0.22/0.58 # Clause-clause subsumption calls (NU) : 2627
% 0.22/0.58 # Rec. Clause-clause subsumption calls : 2250
% 0.22/0.58 # Non-unit clause-clause subsumptions : 100
% 0.22/0.58 # Unit Clause-clause subsumption calls : 40
% 0.22/0.58 # Rewrite failures with RHS unbound : 0
% 0.22/0.58 # BW rewrite match attempts : 115
% 0.22/0.58 # BW rewrite match successes : 70
% 0.22/0.58 # Condensation attempts : 316
% 0.22/0.58 # Condensation successes : 0
% 0.22/0.58 # Termbank termtop insertions : 24683
% 0.22/0.58 # Search garbage collected termcells : 5065
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.032 s
% 0.22/0.58 # System time : 0.005 s
% 0.22/0.58 # Total time : 0.037 s
% 0.22/0.58 # Maximum resident set size: 3148 pages
% 0.22/0.58
% 0.22/0.58 # -------------------------------------------------
% 0.22/0.58 # User time : 0.115 s
% 0.22/0.58 # System time : 0.018 s
% 0.22/0.58 # Total time : 0.132 s
% 0.22/0.58 # Maximum resident set size: 2048 pages
% 0.22/0.58 % E---3.1 exiting
% 0.22/0.58 % E exiting
%------------------------------------------------------------------------------